Weakly and Nearly Countably Compactness in Generalized Topology

COUNTABLY NEAR PS-COMPACTNESS IN L-TOPOLOGICAL SPACES

In this paper, the concept of countably near PS-compactness inL-topological spaces is introduced, where L is a completely distributive latticewith an order-reversing involution. Countably near PS-compactness is definedfor arbitrary L-subsets and some of its fundamental properties are studied.

Compactness in Topology and Computation

On Intuitionistic Fuzzy β-Almost Compactness and β-Nearly Compactness

The concept of intuitionistic fuzzy β-almost compactness and intuitionistic fuzzy β-nearly compactness in intuitionistic fuzzy topological spaces is introduced and studied. Besides giving characterizations of these spaces, we study some of their properties. Also, we investigate the behavior of intuitionistic fuzzy β-compactness, intuitionistic fuzzy β-almost compactness, and intuitionistic fuzz...

Weakly Countably Determined Spaces of High Complexity

We prove that there exist weakly countably determined spaces of complexity higher than coanalytic. On the other hand, we also show that coanalytic sets can be characterized by the existence of a cofinal adequate family of closed sets. Therefore the Banach spaces constructed by means of these families have at most coanalytic complexity.

Compactness in locales and in formal topology

If a locale is presented by a “flat site”, it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is derived for compactness of the locale (and also for its openness). Although its derivation uses impredicative constructions, it is also shown predicatively using the inductive generation of formal topologies. A predicative proof of ...